A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths

نویسنده

Pawel Pralat

چکیده

In this note we consider the on-line Ramsey numbers R(Pn, Pm) for paths. Using a high performance computing clusters, we calculated the values for off-diagonal numbers for paths of lengths at most 8. Also, we were able to check thatR(P9, P9) = 17, thus solving the problem raised in [5].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on small on-line Ramsey numbers for paths and their generalization

In this note, we consider the on-line Ramsey numbers R(Pn) for paths and their generalization. The standard on-line Ramsey game is played on an unbounded set of vertices, whereas the new variant of the game we consider is the game where the number of vertices is bounded. Using a computer cluster of 80 processors, we ‘calculated’ some new values for short paths, both for the generalized on-line ...

متن کامل

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers

This paper studies lower bounds for classical multicolor Ramsey numbers, first by giving a short overview of past results, and then by presenting several general constructions establishing new lower bounds for many diagonal and off-diagonal multicolor Ramsey numbers. In particular, we improve several lower bounds for Rk(4) and Rk(5) for some small k, including 415 ≤ R3(5), 634 ≤ R4(4), 2721 ≤ R...

متن کامل

Zarankiewicz Numbers and Bipartite Ramsey Numbers

The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...

متن کامل

Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers

The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi–coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. We previously confined our attention to diagonal multipartite Ramsey numbers. In this paper the definition...

متن کامل